Comparison of two new approaches to variable ordering for binary decision diagrams
نویسندگان
چکیده
منابع مشابه
Comparison of variable ordering heuristics / algorithms for binary decision diagrams
Fault tree analysis is a commonly used technique to assess the systems reliability performance in terms of its components reliability characteristics. More recently, the Binary Decision Diagram (BDD) methodology has been introduced which significantly aids the analysis of the fault tree diagram. The approach has been shown to improve both the efficiency of determining the minimal cut sets of th...
متن کاملGenetic Algorithm for Variable Ordering of Ordered Binary Decision Diagrams
Ordered Binary Decision Diagrams are a data structure for representation and manipulation of Boolean functions often applied in VLSI design. The choice of the variable ordering largely influences the size of these structures, size which may vary from polynomial to exponential in the number of variables. A genetic algorithm is applied to find a variable ordering that minimizes the size of ordere...
متن کاملBinary Decision Diagrams and Its Variable Ordering for Disjoint Network
Binary Decision Diagrams and Its Variable Ordering for Disjoint Network Manoj Singhal Associate professor, Department of Information Technology, Accurate Institute of Management & Technology, Greater Noida (U.P.), India, Email: [email protected] Girish Sharma Associate Professor, Department of Computer Applications, Bhai Parmanand Institute of Business Studies, New Delhi Email: gkps1...
متن کاملNew Metrics for Static Variable Ordering in Decision Diagrams
We investigate a new class of metrics to find good variable orders for decision diagrams in symbolic state-space generation. Most of the previous work on static ordering is centered around the concept of minimum variable span, which can also be found in the literature under several other names. We use a similar concept, but applied to event span, and generalize it to a family of metrics paramet...
متن کاملGenetic Algorithms for the Variable Ordering Problem of Binary Decision Diagrams
Ordered binary decision diagrams (BDDs) yield a data structure for switching functions that has been proven to be very useful in many areas of computer science. The major problem with BDD-based calculations is the variable ordering problem which addresses the question of finding an ordering of the input variables which minimizes the size of the BDD-representation. In this paper, we discuss the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quality and Reliability Engineering International
سال: 2001
ISSN: 0748-8017,1099-1638
DOI: 10.1002/qre.406